The friendship paradox in scale-free networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The friendship paradox in scale-free networks

Our friends have more friends than we do. That is the basis of the friendship paradox. In mathematical terms, the mean number of friends of friends is higher than the mean number of friends. In the present study, we analyzed the relationship between the mean degree of vertices (individuals), 〈k〉, and the mean number of friends of friends, 〈kFF 〉, in scale-free networks with degrees ranging from...

متن کامل

Second Parrondo's Paradox in Scale Free Networks

Parrondo’s paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo’s games apparently with the same paradoxical property have been introduced [5]; history dependence, one dimensional line, two dimensional...

متن کامل

Parrondo Paradox in Scale Free Networks

Parrondo’s paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo’s games with paradoxical property have been introduced. In this paper, I examine whether Parrondo’s paradox occurs or not in scale free networks. Two model...

متن کامل

The friendship paradox∗

Why do your friends have more friends than you do? The question may sound offensive. We don’t even know you. How can we assume than you have fewer friends than your friends have on average? Because most people do. This so-called friendship paradox has first been described and studied in [1]. It does seem counterintuitive: If we are talking about the average number of friends of average friends ...

متن کامل

Generalized friendship paradox in networks with tunable degree-attribute correlation

One of the interesting phenomena due to topological heterogeneities in complex networks is the friendship paradox: Your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary node attributes, called the generalized friendship paradox (GFP). The origin of GFP at the network level has been shown to be rooted in positive correlations between deg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematical Sciences

سال: 2014

ISSN: 1314-7552

DOI: 10.12988/ams.2014.4288